Holes in random graphs

نویسنده

  • Tomasz Luczak
چکیده

tuczak, T., Holes in random graphs, Discrete Applied Mathematics 30 (1991) 213-219. It is shown that for every E>O with the probability tending to 1 as n-00 a random graph G(n,p) contains induced cycles of all lengths k, 3 <k~ (1 &)n log C/C, provided c(n) = (n l)p(n)-a.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large Holes in Quasi-Random Graphs

Quasi-random graphs have the property that the densities of almost all pairs of large subsets of vertices are similar, and therefore we cannot expect too large empty or complete bipartite induced subgraphs in these graphs. In this paper we answer the question what is the largest possible size of such subgraphs. As an application, a degree condition that guarantees the connection by short paths ...

متن کامل

On Induced Paths, Holes and Trees in Random Graphs

We study the concentration of the largest induced paths, trees and cycles (holes) in the Erdos-Renyi random graph model and prove a 2-point concentration for the size of the largest induced path and hole, for all p = Ω(n ln n). As a corollary, we obtain an improvement over a result of Erdos and Palka concerning the size of the largest induced tree in a random graph. Further, we study the path c...

متن کامل

Some conjectures on perfect graphs

The complement of a graph G is denoted by G. χ(G) denotes the chromatic number and ω(G) the clique number of G. The cycles of odd length at least five are called odd holes and the complements of odd holes are called odd anti-holes. A graph G is called perfect if, for each induced subgraph G of G, χ(G) = ω(G). Classical examples of perfect graphs consist of bipartite graphs, chordal graphs and c...

متن کامل

Crossing Numbers on the Disk with Multiple Holes

In this paper we look at the crossing number, pair crossing number, and odd crossing number of graphs on a disk with multiple holes. We provide an upper bound ⌊ (n−1)2 4 ⌋ for the odd crossing number of graphs on the annulus with n edges. For graphs on a disk with multiple holes, we develop polynomial time algorithms to find the number of crossings between two edges, given their homotopy classe...

متن کامل

The Effect of Exchange-Correlation Holes on the Temperature Dependent Dynamic Dielectric Function of Single-Layer Quantum Wells and Coupled Nanolayers

In this paper, for the first time we have studied theoretically the effect of exchange-correlation holes around electrons in GaAlAs/GaAs/GaAlAs nanostructure on the temperature-dependent dynamic dielectric function of two-dimensional electron gas by employing random phase, STLS and Hubbard approximations. Also, we have investigated another interesting system which is coupled quantum wells struc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 30  شماره 

صفحات  -

تاریخ انتشار 1991